Using branching time temporal logic to synthesize synchronization skeletons
نویسندگان
چکیده
منابع مشابه
Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons
Astract. We present a method of constructing concurrent programs in which the synchronization skeleton of the program is automatically synthesized from a (branching time) temporal logic specification. The synthesis method uses a decision procedure based on the finite model property of the logic to determine satisfiability of the specification formula f. If f is satisfiable, then a model for f w...
متن کاملDesign and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
We propose a method of constructing concurrent programs in which the synchronization skeleton of the program ~s automatically synthesized from a high-level (branching time) Temporal Logic specification. The synchronization skeleton is an abstraction of the actual program where detail irrelevant to synchronization is suppressed. For example, in the synchronization skeleton for a solution to the ...
متن کاملAn Extended Branching-Time Ockhamist Temporal Logic
For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated “restricted variables” called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modal...
متن کاملBranching-Time Temporal Logic and Tree Automata
JJ89] C. Jard and T. Jeron. On-line model-checking for nite linear temporal logic speciications. 6 Conclusions In this paper we showed that tree automata, which have been considered unsuitable for branching-time model checking, provide a neat and optimal framework for branching-time temporal logics and can handle, eeciently, model checking. The crucial point in our method is that when branching...
متن کاملA Decidable Dense Branching-Time Temporal Logic
Timed computation tree logic (Tctl) extends Ctl by allowing timing constraints on the temporal operators. The semantics of Tctl is deened on a dense tree. The satissability of Tctl-formulae is undecidable even if the structures are restricted to dense trees obtained from timed graphs. According to the known results there are two possible causes of such undecidability: the denseness of the under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1982
ISSN: 0167-6423
DOI: 10.1016/0167-6423(83)90017-5